Quantitative convergence rates of Markov chains: A simple account
نویسنده
چکیده
We state and prove a simple quantitative bound on the total variation distance after k iterations between two Markov chains with different initial distributions but identical transition probabilities. The result is a simplified and improved version of the result in Rosenthal (1995), which also takes into account the -improvement of Roberts and Tweedie (1999), and which follows as a special case of the more complicated time-inhomogeneous results of Douc et al. (2002). However, the proof we present is very short and simple; and we feel that it is worthwhile to boil the proof down to its essence. This paper is purely expository; no new results are presented.
منابع مشابه
Recent progress on computable boundsand the simple slice samplerbyGareth
This paper discusses general quantitative bounds on the convergence rates of Markov chains. It then discusses application of these results to simple slice sam-pler algorithms. It is explained how, in some cases, very useful quantitative results are available, for large classes of target distributions.
متن کاملRecent progress on computable bounds and the simple slice sampler
This paper discusses general quantitative bounds on the convergence rates of Markov chains. It then discusses application of these results to simple slice sampler algorithms. It is explained how, in some cases, very useful quantitative results are available, for large classes of target distributions.
متن کاملQuantitative bounds on convergence of time-inhomogeneous Markov Chains
Convergence rates of Markov chains have been widely studied in recent years. In particular, quantitative bounds on convergence rates have been studied in various forms by Meyn and Tweedie (1994), Rosenthal (1995), Roberts and Tweedie (1999), Jones and Hobert (2001), Fort (2001) and others. In this paper, we first extend a result of Rosenthal (1995) concerning quantitative convergence rates for ...
متن کاملApplications of geometric bounds to the convergence rate of Markov chains on Rn
Quantitative geometric rates of convergence for reversible Markov chains are closely related to the spectral gap of the corresponding operator, which is hard to calculate for general state spaces. This article describes a geometric argumen t to give di erent types of bounds for spectral gaps of Markov chains on bounded subsets of R and to compare the rates of convergence of di erent Markov chai...
متن کاملShift-coupling and convergence rates of ergodic averages
We study convergence of Markov chains {Xk} to their stationary distributions π(·). Much recent work has used coupling to get quantitative bounds on the total variation distance between the law L(Xn) and π(·). In this paper, we use shift-coupling to get quantitative bounds on the total variation distance between the ergodic average law 1 n n ∑ k=1 L(Xk) and π(·). This avoids certain problems, re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002